Using ODEs from PEPA models to derive asymptotic solutions for a class of closed queueing networks
نویسندگان
چکیده
In this paper a class of closed queueing network is modelled in the Markovian process algebra PEPA. It is shown that a fluid flow approximation using ordinary differential equations (ODEs) gives rise to well known asymptotic results. This result gives context to the use of a fluid flow approximation and is potentially useful in cases where the model is not obviously a closed queueing network. The approach is illustrated using examples of a secure key distribution centre and a multi-user query processing system. About the author Nigel Thomas joined the School of Computing Science in January 2004 from the University of Durham, where he had been a lecturer since 1998. His research interests lie in performance modelling, in particular Markov modelling through queueing theory and stochastic process algebra. Nigel was awarded a PhD in 1997 and an MSc in 1991, both from the University of Newcastle upon Tyne.Nigel is currently Director of Postgraduate Teaching within the School of Computing Science and Degree Programme Director for the MSc in Computing Science. Suggested keywords PERFORMANCE MODELLING, FLUID APPROXIMATION, STOCHASTIC PROCESS ALGEBRA Using ODEs from PEPA models to derive asymptotic solutions for a class of closed queueing networks Nigel Thomas ∗
منابع مشابه
Efficient solutions of a PEPA model of key distribution centre with a cost function
In this paper we explore the trade-off between security and performance in considering a model of a key distribution centre. The model is specified using the Markovian process algebra PEPA. The basic model suffers from the commonly encountered state space explosion problem, and so we apply some approximate techniques to solve it. First, model reduction techniques and approximation to give a for...
متن کاملA Continuous State Space Approximation for PEPA Queues
PEPA Queues is a formalism that augments queueing networks with customers that have behavioural characteristics, as defined by PEPA components. PEPA Queues suffer from the traditional state-space explosion that affects both closed queueing networks and PEPA models. We discuss a possible solution to this with a continuous state-space approximation that allows us to derive an underlying mathemati...
متن کاملMean Value Analysis for a Class of PEPA Models
In this paper a class of closed queueing network is modelled in the Markovian process algebra PEPA and solved using the classical Mean Value Analysis (MVA). This approach is attractive as it negates the need to derive the entire state space, and so certain metrics from large models can be obtained with little computational effort. The approach is illustrated with two numerical examples. About t...
متن کاملHybrid analysis of large scale PEPA models
We introduce a new hybrid analysis technique for large scale PEPA models that combines stochastic simulation with ODEs, providing a finer trade-off between accuracy of the solutions and the associated computational costs. We describe a version that employs ODEs for the mean component counts and also a version using ODEs for second order moments. This enables the calculation of covariances of co...
متن کاملA Syntactical Analysis of Reversible PEPA Models
Product form solutions have played an important role in the development of performance modelling and in particular in the popularity of queueing network models. The notions of reversibility and quasi-reversibility underpin many product form results in queueing theory. Stochastic process algebras (SPAs) support a compositional approach to performance modelling without severe restriction on the f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009